Spatial logics with connectedness predicates
نویسندگان
چکیده
منابع مشابه
Spatial logics with connectedness predicates
We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological connectedness of regions and restrict the number of their connected components. We investigate the computational complexity of these logics and show that the connectedness constraints can increase complexity from NP to PSpace, E...
متن کاملLogics of Space with Connectedness Predicates: Complete Axiomatizations
In this paper we present a complete quantifier-free axiomatization of several logics on region-based theory of space based on contact relation and connectedness predicates. We prove completeness theorems for the logics in question with respect to three different semantics: algebraic – with respect to several important classes of contact algebras, topological – based on the contact algebras over...
متن کاملOn the Computational Complexity of Spatial Logics with Connectedness Constraints
We investigate the computational complexity of spatial logics extended with the means to represent topological connectedness and restrict the number of connected components. In particular, we show that the connectedness constraints can increase complexity from NP to PSpace, ExpTime and, if component counting is allowed, to NExpTime.
متن کاملA Topological logics with connectedness over Euclidean spaces
We consider the quantifier-free languages, Bc and Bc◦, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of Rn (n ≥ 2) and, additionally, over the regular closed semilinear sets of Rn. The resulti...
متن کاملPolynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates
We consider instance queries mediated by an ontology expressed in the expressive DL ALCHIO with closed predicates. We observe that such queries are non-monotonic and cannot be expressed in monotonic variants of DATALOG, but a polynomial time translation into disjunctive DATALOG extended with negation as failure is feasible. If no closed predicates are present–in the case of classical instance c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2010
ISSN: 1860-5974
DOI: 10.2168/lmcs-6(3:7)2010